Graph automorphisms of a finite modular lattice
نویسندگان
چکیده
منابع مشابه
Total graph of a $0$-distributive lattice
Let £ be a $0$-distributive lattice with the least element $0$, the greatest element $1$, and ${rm Z}(£)$ its set of zero-divisors. In this paper, we introduce the total graph of £, denoted by ${rm T}(G (£))$. It is the graph with all elements of £ as vertices, and for distinct $x, y in £$, the vertices $x$ and $y$ are adjacent if and only if $x vee y in {rm Z}(£)$. The basic properties of the ...
متن کاملA Note on Absolute Central Automorphisms of Finite $p$-Groups
Let $G$ be a finite group. The automorphism $sigma$ of a group $G$ is said to be an absolute central automorphism, if for all $xin G$, $x^{-1}x^{sigma}in L(G)$, where $L(G)$ be the absolute centre of $G$. In this paper, we study some properties of absolute central automorphisms of a given finite $p$-group.
متن کاملA Kind of Non-commuting Graph of Finite Groups
Let g be a fixed element of a finite group G. We introduce the g-noncommuting graph of G whose vertex set is whole elements of the group G and two vertices x,y are adjacent whenever [x,y] g and [y,x] g. We denote this graph by . In this paper, we present some graph theoretical properties of g-noncommuting graph. Specially, we investigate about its planarity and regularity, its clique number a...
متن کاملAutomorphisms of Finite Fields
Let F be a finite field, and 4: F* + E a surjective group homomorphism from the multiplicative group F* of F to a non-trivial abelian group E. A theorem of McConnel (Acta Arith. 8 (1963) 127-151) describes the permutations e of F with the property that d(ux uy) = d(x y) for all X, j’ E F, .Y #J. We give a short proof of this theorem, based on an argument of Bruen and Levinger (Canad. J. Math. 2...
متن کاملAutomorphisms of Neighborhood Sequence of a Graph
Let G be a graph, u be a vertex of G, and B(u)(or BG(u)) be the set of u with all its neighbors in G. A sequence (B1, B2, ..., Bn) of subsets of an n-set S is a neighborhood sequence if there exists a graph G with a vertex set S and a permutation (v1, v2, ..., vn) of S such that B(vi) = Bi for i = 1, 2, ..., n. Define Aut(B1, B2, ..., Bn) as the set {f : f is a permutation of V (G) and (f(B1), ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1999
ISSN: 0011-4642,1572-9141
DOI: 10.1023/a:1022425007638